A Modeling Framework to Implement Preemption Policies in Non-Markovian SPNs
نویسندگان
چکیده
ÐPetri nets represent a useful tool for performance, dependability, and performability analysis of complex systems. Their modeling power can be increased even more if nonexponentially distributed events are considered. However, the inclusion of nonexponential distributions destroys the memoryless property and requires to specify how the marking process is conditioned upon its past history. In this paper, we consider, in particular, the class of stochastic Petri nets whose marking process can be mapped into a Markov regenerative process. An adequate mathematical framework is developed to deal with the considered class of Markov Regenerative Stochastic Petri Nets (MRSPN). An unified approach for the solution of MRSPNs where different preemption policies can be defined in the same model is presented. The solution is provided both in steady-state and in transient condition. An example concludes the paper. Index TermsÐStochastic Petri Nets, Markov regenerative processes, preemptive policies, transient and steady-state analysis.
منابع مشابه
The Möbius Execution Policy
Möbius is an extensible framework and tool for performance and dependability modeling, and supports multiple modeling formalisms and solvers. As a framework, Möbius must be sufficiently general to capture the various formalism behaviors. Specifically, the Möbius execution policy must be flexible enough to accommodate the execution policies of all formalisms implemented in the framework. We know...
متن کاملThe Möbius Execution Policy ∗ Daniel
Möbius is an extensible framework and tool for performance and dependability modeling, and supports multiple modeling formalisms and solvers. As a framework, Möbius must be sufficiently general to capture the various formalism behaviors. Specifically, the Möbius execution policy must be flexible enough to accommodate the execution policies of all formalisms implemented in the framework. We know...
متن کاملSpeciications and Solution Techniques for Non-markovian Stochastic Petri Nets
Allmost all the available tools for the analysis of Stochastic Petri Nets (SPN) assume that the stochastic nature of the problem is restricted to be a Continuous Time Markov Chain (CTMC), but in reality, there are instances in which the CTMC assumption is too weak. The evolution of the stochastic systems with non-exponential timing becomes a stochastic process, for which in general, no analytic...
متن کاملSpeci cations and Solution Techniques for Non-Markovian Stochastic Petri Nets
Allmost all the available tools for the analysis of Stochastic Petri Nets (SPN) assume that the stochastic nature of the problem is restricted to be a Continuous Time Markov Chain (CTMC), but in reality, there are instances in which the CTMC assumption is too weak. The evolution of the stochastic systems with nonexponential timing becomes a stochastic process, for which in general, no analytica...
متن کاملScheduling a constellation of agile earth observation satellites with preemption
In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Software Eng.
دوره 26 شماره
صفحات -
تاریخ انتشار 2000